Graph Partitioning: A Heuristic Procedure to Partition Network Graphs

نویسندگان

  • Deepak Mishra
  • Pramit Das
  • A. K. Turuk
چکیده

...................................................................................iii LIST OF FIGURES...........................................................................................iv INTRODUCTION..............................................................................................1 Scope and Motivation................................................................1 Basic Definitions.....................................................................2 GRAPH PARTITIONING PROBLEM............................................................4 Classes of Network Partition....................................................5 Clique Partition Problem.................................................................5 Equipartition Problem...............................................................................5 K-way Equipartition Problem...................................................................5 K-way Partition Problem..........................................................................5 Capacitated Partitioning Problem.............................................................6 Maxcut Problem........................................................................................6 Previous Attempts....................................................................7 Random Solutions.....................................................................................7 Max Flow-Min Cut...................................................................................7 Clustering..................................................................................................8 λ-opting.....................................................................................................9 2-WAY UNIFORM PARTITION...................................................................10 Introduction.........................................................................10 Phase 1 Partition...........................................................................12 Effectiveness of the Procedure..................................................15 Running Time of the Procedure................................................16 Improving Phase 1 Partition...................................................19 Partitioning Unequal Sized Sets...............................................21 Modified Task Performed........................................................22 CONCLUSION.................................................................................................29 REFERENCES..................................................................................................31

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Kerninghan/Lin: ParMETIS

Graph partitioning has become an important facet of computer science with its applications in many disciplines. Graph partitioning is NPcomplete and has given rise to many heuristic algorithms in order to achieve the best estimate in a decent amount of time. ParMETIS is an MPI-based parallel library that implements the heuristic multilevel Kerninghan/Lin algorithm to partition and repartition u...

متن کامل

An Implementation of State-of-the-Art Graph Bisection Algorithms

In recent decades, various graph partitioning heuristic algorithms have been developed by researchers, which are widely used in “realworld” applications. As a starting point of graph partition problem, graph bisection algorithms provide basic approaches and solutions for other graph partition instances. This work implemented part of contemporary graph bisection algorithms which produce high-qua...

متن کامل

Graph Bisection Optimization: A Comparison Between GA, ILS and FF Metaheuristics

The aim of this paper is to compare different metaheuristics for the graph bisection problem. For this purpose, the Bui and Moon’s genetic algorithm adaptation for graph bisection is used. A second genetic algorithm adaptation for graph bisection is also presented. These algorithms are compared to an implementation of the iterated local search metaheuristic for graph bisection. All these metahe...

متن کامل

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [4, 26]. From the early work it was clear that multilevel techniques held great promise; however, it was not known if they can be made to...

متن کامل

Multilevel Graph Partitioning Schemes

In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009